Bidirectional Cooperating Distributed Grammar Systems Bidirectional Cooperating Distributed Grammar Systems
نویسندگان
چکیده
We consider bidirectional cooperating distributed (BCD) grammar systems in the sense of Asveld. Independently of their mode , , =, , or t, BCD grammar systems with two components characterize the re-cursively enumerable languages even with right-linear rules and without-productions. This sharply contrasts earlier results on solely generating or accepting grammars, where right-linear rules always only lead to regular languages. Further restrictions lead to language families closely related to Lindenmayer language families. Moreover, we can solve some open problems in the theory of bidirec-tional grammars in this way.
منابع مشابه
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes
We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating distributed grammar systems working in hybrid modes which characterize programmed grammars with the finite index restriction; looking at the number of components of such systems, we obtain surprisingly rich lattice st...
متن کاملCooperating Distributed Grammar Systems with Random Context Grammars as Components
In this paper, we discuss cooperating distributed grammar systems where components are (variants of) random context grammars. We give an overview of known results and open problems, and prove some further results.
متن کاملOn the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components
This paper discusses the terminating derivation mode in cooperating distributed grammar systems where components are forbidding grammars instead of context-free grammars. Such systems are called forbidding cooperating distributed grammar systems, and it is demonstrated that the number of their components can be reduced to two without changing the generative power and that these systems are comp...
متن کاملCooperating Distributed Grammar systems: A Comparison of Generavite Power
Cooperating Distributed Grammar systems have been introduced for describing multi-agent systems by means of formal grammars and languages. There are currently a lot of variations that differ by generative power. This article is focused on summarize definitions of selected CD grammar systems (homogenous, hybrid, and teams) and comparison of their generative power among themselves and against to ...
متن کاملCooperating distributed context-free hexagonal array grammar systems with permitting contexts
In this paper we associate permitting symbols with rules of Grammars in the components of cooperating distributed context-free hexagonal array grammar systems as a control mechanism and investigating the generative power of the resulting systems in the terminal mode. This feature of associating permitting symbols with rules when extended to patterns in the form of connected arrays also requires...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996